General Preferential Entailments as Circumscriptions

نویسنده

  • Yves Moinard
چکیده

A (general) preferential entailment is defined by a “preference relation” among “states”. States can be either interpretations or sets of interpretations, or “copies” of interpretations or of sets of interpretations, although it is known that the second kind and the fourth one produce the same notion. Circumscription is a special case of the simplest kind, where the states are interpretations. It is already known that a large class of preferential entailments where the states are copies of interpretations, namely the “cumulative” ones, can be expressed as circumscriptions in a greater vocabulary. We extend this result to the most general kind of general preferential entailment, the additional property requested here is “loop”, a strong kind of “cumulativity”. The greater vocabulary needed here is large, but only a very simple and small set of formulas in this large vocabulary is necessary, which should make the method practically useful.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Circumscriptions from What They Cannot Do (preliminary Report)

We show that, in the nite propositional case, traditional circumscrip-tions can be fully described only from the formulas which can never come as a result of the given circumscription (the \inaccessible formulas"). Some work has already been done on the subject. Siegel and Forget have introduced the general notion of X-logic, and they have considered the case of nite proposi-tional circumscript...

متن کامل

A Preferential Framework for Trivialization-Resistant Reasoning with Inconsistent Information

Paraconsistent entailments based on more than two truthvalues are useful formalisms for handling inconsistent information in large knowledge bases. However, such entailments suffer from two major drawbacks: they are often too cautious to allow intuitive classical inference, and are trivialization-prone. Two preferential mechanisms have been proposed to deal with these two problems, but they are...

متن کامل

Characterizing General Preferential Entailments

A preferential entailment is defined by a binary relation, or “preference relation”. This relation can be either among interpretations or among sets of interpretations. The relation can be also among “states” which are “copies of interpretations”, or “copies of sets of interpretations”. This provides four kinds of preferential entailments. The paper deals mainly with propositional logic, howeve...

متن کامل

Linking Makinson and Kraus-Lehmann-Magidor preferential entailments

Twelve years ago, various notions of preferential entailment have been introduced. The main reference is a paper by Kraus, Lehmann and Magidor (KLM), one of the main competitor being a more general version defined by Makinson (MAK). These two versions have already been compared, but it is time to revisit these comparisons. Here are our main results: (1) These two notions are equivalent, provide...

متن کامل

Preferential Reasoning Based On Abstract Argumentation Semantics

We introduce a preferential-based setting for reasoning with different types of argumentation-based semantics, including those that are not necessarily conflict-free or admissible. The induced entailments are defined by n-valued labeling and may be computed by answer-set programs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001